Matrix Representations by Means of Interpolation
نویسندگان
چکیده
We examine two different matrix representations of curves and surfaces based on or constructed by interpolation through points. Both are essentially implicit representations of objects given as parametric models or given as a point cloud, and both are quite powerful since they reduce geometric operations to linear algebra. First, we examine a representation by interpolation matrices, developed for plane curves, surfaces, and hypersurfaces, which is not sensitive to base points. We extend the method to parametric space curves and, generally, objects of codimension higher than 1, by computing the equations of (hyper)surfaces intersecting precisely at the given object. We propose a practical algorithm that uses interpolation and always produces correct output but possibly with a number of surfaces higher than minimal. Our experiments indicate that, typically, a small number of computed surfaces defines exactly any given space curve. Our second contribution concerns the same representation and completes its properties by showing how it can be used for ray shooting of a parametric ray with a surface patch, given by a parametric or point cloud model. Most matrix operations are executed in pre-processing since they solely depend on the surface but not on the ray. For a given ray, the bottleneck is equation solving. We present experiments in Maple: ray shooting for a bicubic patch takes ≤ 1 sec, though numerical issues might arise. Our approach covers the case of intersection points of high multiplicity. It is extendable to surface-surface intersections yielding an implicit representation of the intersection curve in the plane of one surface’s parameters. The second representation examined is based on syzygies. The corresponding theory, including μ-bases, has been developed for parametric models. Our third contribution is to show how to compute the required syzygies by interpolation, when the input curve or surface is given by a point cloud whose sampling satisfies mild assumptions; this significantly generalizes the method. Even when noise corrupts the sampling, it is possible to estimate the necessary degree of the syzygies and interpolate them numerically, thus constructing the matrix representing the implicit object.
منابع مشابه
COMPOSITE INTERPOLATION METHOD AND THE CORRESPONDING DIFFERENTIATION MATRIX
Properties of the hybrid of block-pulse functions and Lagrange polynomials based on the Legendre-Gauss-type points are investigated and utilized to define the composite interpolation operator as an extension of the well-known Legendre interpolation operator. The uniqueness and interpolating properties are discussed and the corresponding differentiation matrix is also introduced. The appl...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملIntegral representations for generalized difference kernels having a finite number of negative squares
An integral representation is derived for matrix-valued generalized difference kernels which have a finite number of negative squares. The representation is used to extend such kernels to the real line with a bound on the number of negative squares. The main results are obtained by means of an operator interpolation theorem. The nondegenerate case is assumed. Mathematics Subject Classification ...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کامل